Solution of a Problem of Barendregt on Sensible Λ-theories
نویسندگان
چکیده
H is the theory extending β-conversion by identifying all closed unsolvables. Hω is the closure of this theory under the ω-rule (and β-conversion). A long-standing conjecture of H. Barendregt states that the provable equations of Hω form a Π11-complete set. Here we prove that conjecture.
منابع مشابه
Solution of a Problem of Barendregt on Sensible Λ-theories Benedetto Intrigila and Richard Statman
H is the theory extending β-conversion by identifying all closed unsolvables. Hω is the closure of this theory under the ω-rule (and β-conversion). A long-standing conjecture of H. Barendregt states that the provable equations of Hω form a Π11-complete set. Here we prove that conjecture.
متن کاملSolution of a Problem of Barendregt on Sensible lambda-Theories
H is the theory extending β-conversion by identifying all closed unsolvables. Hω is the closure of this theory under the ω-rule (and β-conversion). A long-standing conjecture of H. Barendregt states that the provable equations of Hω form a Π11-complete set. Here we prove that conjecture.
متن کاملGraph Lambda Theories † a N T O N I O B U C C I a R E L L I and a N T O N I N O S a L I B R A
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theory H (generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal sensible λ-theory represented by it. In this paper, we giv...
متن کاملOn Henk Barendregt’s Favorite Open Problem
H is the λ-theory extending β-conversion by identifying all closed unsolvables. A long-standing open problem of H. Barendregt states that the range property holds in H. Here we discuss what we know about the problem. We also make some remarks on the λ-theory Hω (the closure of H under the ω-rule and β-conversion).
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کامل